{	Problem: http://codeforces.ru/problemset/problem/59/B
 	Verdict: Accepted
}
var n,i,p,c,k:longint; a:array[1..110] of longint;
procedure qsort(l,r:longint);
var i,j,x,y:longint;
begin
i:=l;
j:=r;
x:=a[(l+r) div 2];
repeat
  while a[i]>x do inc(i);
  while a[j]<x do dec(j);
  if i<=j then begin
    y:=a[i];
    a[i]:=a[j];
    a[j]:=y;
    inc(i);
    dec(j);
  end;
until i>j;
if l<j then qsort(l,j);
if i<r then qsort(i,r);
end;
begin
read(n);
c:=0;
p:=0;
for i:=1 to n do read(a[i]);
qsort(1,n);
for i:=1 to n do begin
  k:=p;
  inc(k,a[i]);
  inc(c,a[i]);
  if odd(k) then p:=k;
  if odd(c) and (c>p) then p:=c;
end;
write(p);
end.